Gaussian phases in generalized coupon collection
نویسندگان
چکیده
منابع مشابه
Generalized Coupon Collection: the Superlinear Case
We consider a generalized form of the coupon collection problem in which a random number, S, of balls is drawn at each stage from an urn initially containing n white balls (coupons). Each white ball drawn is colored red and returned to the urn; red balls drawn are simply returned to the urn. The question considered is then: how many white balls (uncollected coupons) remain in the urn after the ...
متن کاملEn passant Coupon Collection
Spontaneous interaction in public places has evolved as crucial concern in interaction design, particularly in the domain of public advertising. Implicit interaction is a mode of spontaneous interaction in which the user is not attentively or explicitly expressing input to a system, but the system from observing the user, and considering all the available information that describes the user sit...
متن کاملThe Coupon Subset Collection Problem
The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We provide bounds on this number, give effic...
متن کاملThe Hypergeometric Coupon Collection Problem and its Dual
Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all o...
متن کاملDeterministic Coupon Collection and Better Strong Dispersers
Hashing is one of the main techniques in data processing and algorithm design for very large data sets. While random hash functions satisfy most desirable properties, it is often too expensive to store a fully random hash function. Motivated by this, much attention has been given to designing small families of hash functions suitable for various applications. In this work, we study the question...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2010
ISSN: 0001-8678,1475-6064
DOI: 10.1239/aap/1293113148